38 research outputs found
Trees with maximum number of maximal matchings
AbstractForests on n vertices with maximum number of maximal matchings are called extremal forests. All extremal forests, except 2K1, are trees. Extremal trees with small number n of vertices, n⩽19, are characterized; in particular, they are unique if n≠6. The exponential upper and lower bounds on the maximum number of maximal matchings among n-vertex trees have been found
On some third parts of nearly complete digraphs
AbstractFor the complete digraph DKn with n⩾3, its half as well as its third (or near-third) part, both non-self-converse, are exhibited. A backtracking method for generating a tth part of a digraph is sketched. It is proved that some self-converse digraphs are not among the near-third parts of the complete digraph DK5 in four of the six possible cases. For n=9+6k,k=0,1,…, a third part D of DKn is found such that D is a self-converse oriented graph and all D-decompositions of DKn have trivial automorphism group
A partial refining of the Erdős-Kelly regulation
The aim of this note is to advance the refining of the Erdős-Kelly result on graphical inducing regularization. The operation of inducing regulation (on graphs or multigraphs) with prescribed maximum vertex degree is originated by D. König in 1916. As is shown by Chartrand and Lesniak in their textbook Graphs & Digraphs (1996), an iterated construction for graphs can result in a regularization with many new vertices. Erdős and Kelly have presented (1963, 1967) a simple and elegant numerical method of determining for any simple -vertex graph with maximum vertex degree , the exact minimum number, say , of new vertices in a -regular graph which includes as an induced subgraph. The number , which we call the cost of regulation of , has been upper-bounded by the order of , the bound being attained for each , e.g. then the edge-deleted complete graph has . For , we present all factors of with and next . Therein in case and odd only, we show that a specific extra structure, non-matching, is required
Some maximum multigraphs and edge/vertex distance colourings
Shannon-Vizing-type problems concerning the upper bound for a distance chromatic index of multigraphs G in terms of the maximum degree Δ(G) are studied. Conjectures generalizing those related to the strong chromatic index are presented. The chromatic d-index and chromatic d-number of paths, cycles, trees and some hypercubes are determined. Among hypercubes, however, the exact order of their growth is found
Decompositions into two paths
It is proved that a connected multigraph G which is the union of two edge-disjoint paths has another decomposition into two paths with the same set, U, of endvertices provided that the multigraph is neither a path nor cycle. Moreover, then the number of such decompositions is proved to be even unless the number is three, which occurs exactly if G is a tree homeomorphic with graph of either symbol + or ⊥. A multigraph on n vertices with exactly two traceable pairs is constructed for each n ≥ 3. The Thomason result on hamiltonian pairs is used and is proved to be sharp